An effective iterated greedy algorithm for blocking hybrid flow shop problem with due date window

Nowadays many industry consider an interval time as a due date instead of precise points in time. In this study, the hybrid flow shop scheduling problem with basic blocking constraint is tackled. Where jobs, if done within window, are deemed on Therefore, criterion to minimize sum weighted earliness and tardiness. This variant flowshop not investigated best our knowledge. we introduced new metaheuristic centered iterated greedy approach. evaluate proposed method start by re-implementation comparison seven well-selected procedures that treat problem. order prove robustness method, evaluated it using benchmark more than 1000 instances. The experimental results demonstrated algorithm effective produces very high solution.